Explaining Genetic Knock-Out Effects Using Cost-Based Abduction

نویسندگان

  • Emad A. M. Andrews Shenouda
  • Anthony J. Bonner
چکیده

Cost-Based Abduction (CBA) is an AI model for reasoning under uncertainty. In CBA, evidence to be explained is treated as a goal which is true and must be proven. Each proof of the goal is viewed as a feasible explanation and has a cost equal to the sum of the costs of all hypotheses that are assumed to complete the proof. The aim is to find the Least Cost Proof. This paper uses CBA to develop a novel method for modeling Genetic Regulatory Networks (GRN) and explaining genetic knock-out effects. Constructing GRN using multiple data sources is a fundamental problem in computational biology. We show that CBA is a powerful formalism for modeling GRN that can easily and effectively integrate multiple sources of biological data. In this paper, we use three different biological data sources: Protein-DNA, Protein–Protein and gene knock-out data. Using this data, we first create an un-annotated graph; CBA then annotates the graph by assigning a sign and a direction to each edge. Our biological results are promising; however, this manuscript focuses on the mathematical modeling of the application. The advantages of CBA and its relation to Bayesian inference are also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Planning Using Iterative Improvement Methods and Heuristic Techniques

The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...

متن کامل

A Linear Constraint Satisfaction Approach to Cost-Based Abduction

Santos Jr, E., A linear constraint satisfaction approach to cost-based abduction, Artificial Intelligence 65 (1994) 1-27. Abduction is the problem of finding the best explanation for a given set of observations. Within AI, this has been modeled as proving the observation by assuming some set of hypotheses. Cost-based abduction associates a cost with each hypothesis. The best proof is the one wh...

متن کامل

A creative abduction approach to scientific and knowledge discovery

In this paper we explore the range of applicability of abductive reasoning for knowledge discovery. In particular, we discuss a novel form of abduction, called creative abduction, where new knowledge is generated in the process of explaining observed events, and demonstrate its relevance to knowledge discovery. The main contribution of this paper is twofold: First, we show that creative abducti...

متن کامل

The Role of Abduction in Declarative Authorization Policies

Declarative authorization languages promise to simplify the administration of access control systems by allowing the authorization policy to be factored out of the implementation of the resource guard. However, writing a correct policy is an error-prone task by itself, and little attention has been given to tools and techniques facilitating the analysis of complex policies, especially in the co...

متن کامل

Generalized Chart Algorithm: An Efficient Procedure for Cost-Based Abduction

We present an efficient procedure for cost-based abduction , which is based on the idea of using chart parsers as proof procedures. We discuss in detail three features of our algorithm-goal-driven bottom-up derivation, tabulation of the partial results , and agenda control mechanism-and report the results of the preliminary experiments, which show how these features improve the computational ef...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011